全文获取类型
收费全文 | 12752篇 |
免费 | 1518篇 |
国内免费 | 768篇 |
专业分类
化学 | 4205篇 |
晶体学 | 32篇 |
力学 | 801篇 |
综合类 | 327篇 |
数学 | 7104篇 |
物理学 | 2569篇 |
出版年
2024年 | 14篇 |
2023年 | 198篇 |
2022年 | 349篇 |
2021年 | 439篇 |
2020年 | 578篇 |
2019年 | 474篇 |
2018年 | 448篇 |
2017年 | 535篇 |
2016年 | 527篇 |
2015年 | 433篇 |
2014年 | 637篇 |
2013年 | 896篇 |
2012年 | 673篇 |
2011年 | 740篇 |
2010年 | 677篇 |
2009年 | 904篇 |
2008年 | 806篇 |
2007年 | 719篇 |
2006年 | 732篇 |
2005年 | 570篇 |
2004年 | 519篇 |
2003年 | 443篇 |
2002年 | 391篇 |
2001年 | 332篇 |
2000年 | 323篇 |
1999年 | 283篇 |
1998年 | 270篇 |
1997年 | 188篇 |
1996年 | 136篇 |
1995年 | 154篇 |
1994年 | 120篇 |
1993年 | 95篇 |
1992年 | 84篇 |
1991年 | 49篇 |
1990年 | 41篇 |
1989年 | 39篇 |
1988年 | 29篇 |
1987年 | 25篇 |
1986年 | 20篇 |
1985年 | 38篇 |
1984年 | 28篇 |
1983年 | 8篇 |
1982年 | 18篇 |
1981年 | 6篇 |
1980年 | 9篇 |
1979年 | 14篇 |
1978年 | 5篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1974年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 546 毫秒
101.
102.
Zhang Shenggui Sun Hao Li Xueliang .Dept.of Appl. Math. Northwestern Polytechnical Univ. Xi''''an China. .Center of Combinatorics Nankai Univ. Tianjin China. 《高校应用数学学报(英文版)》2002,(3)
§ 1 IntroductionAll graphsconsidered in this paperare finite undirected ones withoutloops ormultipleedges.Our terminology and notation are standard exceptas indicated.A good reference forany undefined terms is[1 ] .Let G be a graph with vertex set V( G) and edge set E( G) .The density of G is definedbyd( G) =ε( G)ν( G) ,whereν( G) andε( G) denote| V( G) | and| E( G) | ,respectively.G is said to be balanced iffor each subgraph H of G we have d( H )≤ d( G) ,where V( H ) is assum… 相似文献
103.
1989年发表的Bager第五图,包含关于三角形元素的35个二次规范画数之间的51个不等式通过细致的分析,本文给出了其中遗漏的12个基本不等式 相似文献
104.
侯旻 《新疆大学学报(理工版)》1991,(1)
本文比较了循环图类{c_p(n_1,…,n_p)}和{c-p(n_1…,n_p,p/α)}的直径下界。对于p和α满足一定条件的循环图类{c_p(n_1,n_2,p/α)},本文给出了达到或几乎达到此图类直径下界的一类几乎最优循环图{c_p(m,m+1,p/α)}。 相似文献
105.
Youssef Saab 《Journal of Heuristics》1997,3(3):207-224
A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem. 相似文献
106.
We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process in group technology. Three types of economic decisions are considered: subcontracting, machine duplication and intercell moves. The problem is formulated as a minimum weighted node covering problem in a hypergraph, and we show that it can be solved in polynomial time by finding a maximum weighted stable set in a bipartite graph. We extend this result to cellular manufacturing systems in which the sequence of operations of each part is known in advance. 相似文献
107.
In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful theorem capturing the ``rough' structure
of graphs excluding a fixed minor. This result was used to prove Wagner's Conjecture that finite graphs are well-quasi-ordered
under the graph minor relation. Recently, a number of beautiful results that use this structural result have appeared. Some
of these along with some other recent advances on graph minors are surveyed.
Research partly supported by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research, Grant number
16740044, by Sumitomo Foundation, by C & C Foundation and by Inoue Research Award for Young Scientists
Supported in part by the Research Grant P1–0297 and by the CRC program
On leave from: IMFM & FMF, Department of Mathematics, University of Ljubljana, Ljubljana, Slovenia 相似文献
108.
王军秀 《纯粹数学与应用数学》2007,23(3):406-408
利用欧拉公式研究了Gdk图的平面性,获得了一个重要定理,并由此得到了关于平面图色数的一个结论. 相似文献
109.
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and variance of the exponentials of graph eigenvalues cluster around a line segment that we call a filar. Zooming-in reveals that this cluster splits into smaller segments (filars) labeled by the number of triangles in graphs. Further zooming-in shows that the smaller filars split into subfilars labeled by the number of quadrangles in graphs, etc. We call this fractal structure, discovered in a numerical experiment, a multifilar structure. We also provide a mathematical explanation of this phenomenon based on the Ihara-Selberg trace formula, and compute the coordinates and slopes of all filars in terms of Bessel functions of the first kind. 相似文献
110.